A New Verification Technique for Self-Stabilizing Distributed Algorithms based on Variable Structure Systems and Ljapunov Theory
نویسنده
چکیده
A particularly suitable design strategy for constructing a robust distributed computer application is to endow it with a self-stabilization property. Such a property guarantees that the system will always return to and stay within a specified set of legal states within bounded time regardless of its initial state. A self-stabilizing application therefore has the potential of recovering from the effects of arbitrary transient failures. However, to actually prove that an application self-stabilizes can be quite tedious with current verification methodologies and is non-trivial. The self-stabilizing property of distributed algorithms exhibits interesting analogies to stabilizing feedback systems used in various engineering domains. In this paper we show that methodologies from control theory can be used to more easily prove the selfstabilization property of distributed algorithms.
منابع مشابه
Towards Automatic Convergence Verification of Self-stabilizing Algorithms
The verification of the self-stabilization property of a distributed algorithm is a complicated task. By exploiting certain analogies between self-stabilizing distributed algorithms and globally asymptotically stable feedback systems, techniques originally developed for the verification of feedback system stability can be adopted for the verification of selfstabilization of distributed algorith...
متن کاملDistributed verification and Self-stabilization of a DFS Tree
It is a common practice in distributed systems to compute and maintain distributed data structures such as a spanning tree of the network, which can be used by many other algorithms. Corruption of these data structures can cause the protocols that use them to behave incorrectly. A DFS (Depth First Search) spanning tree of a network is one such structure which is very used in various routing pro...
متن کاملVariable Structure Behavioural Controller for Multi-agent Systems
In previous papers authors have considered agents as inertia-less self driven particles and designed a flocking algorithm. Application of this algorithm to agents with considerable inertial characteristics needs a behavioural controller. The controller uses the local information and helps every agent to imitate the desired behaviour as a member of the flocking frame which covers the main is...
متن کاملTime- and space-efficient self-stabilizing algorithms
In a distributed system error handling is inherently more difficult than in conventional systems that have a central control unit. To recover from an erroneous state the nodes have to cooperate and coordinate their actions based on local information only. Self-stabilization is a general approach to make a distributed system tolerate arbitrary transient faults by design. A self-stabilizing algor...
متن کاملComputer Science Technical Report A Self-Stabilizing Distributed Algorithm to Construct An Arbitrary Spanning Tree of a Connected Graph
We propose a simple self-stabilizing distributed algorithm that maintains an arbitrary spanning tree in a connected graph. In proving the correctness of the algorithm we develop a new technique without using a bounded function (which is customary for proving correctness of self-stabilizing algorithms); the new approach is simple and can be potentially applied to proving correctness of other sel...
متن کامل